Periodicity and local complexity
نویسندگان
چکیده
منابع مشابه
Periodicity and local complexity
We consider the complexity of bi-in,nite words in one and two dimensions. A result of Morse and Hedlund in one dimension states that if the complexity, p (n), of a word satis,es p (n)6 n for some n, then the word is periodic. The corresponding question in two dimensions (whether p (m; n)6mn implies that is periodic) is known as the Nivat conjecture. In this paper, we strengthen the one-dimensio...
متن کاملComplexity and Periodicity
Let M be a finitely generated module over an Artin algebra. By considering the lengths of each module in the minimal projective resolution of M , we obtain its Betti sequence. This sequence must be bounded if M is eventually periodic, but the converse fails to hold in general. We give conditions under which this holds, using techniques from Hochschild cohomology. We also provide a result which ...
متن کاملWords with unbounded periodicity complexity
If an infinite non-periodic word is uniformly recurrent or is of bounded repetition, then the limit of its periodicity complexity is infinity. Moreover, there are uniformly recurrent words with the peri-odicity complexity arbitrarily high at infinitely many positions.
متن کاملComplexity of short rectangles and periodicity
The Morse-Hedlund Theorem states that a bi-infinite sequence η in a finite alphabet is periodic if and only if there exists n ∈ N such that the block complexity function Pη(n) satisfies Pη(n) ≤ n. In dimension two, Nivat conjectured that if there exist n, k ∈ N such that the n× k rectangular complexity Pη(n, k) satisfies Pη(n, k) ≤ nk, then η is periodic. Sander and Tijdeman showed that this ho...
متن کاملLocal Squares, Periodicity and Finite Automata
We consider the general problem when local regularity implies the global one in the setting where local regularity means the existence of a square of certain length in every position of an infinite word. The square can occur as centered or to the left or to the right from each position. In each case there are three variants of the problem depending on whether the square is that of words, that o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.02.026